Planning in Dynamic and Partially Unknown Environments

نویسندگان

چکیده

Motion planning in dynamic and partially unknown environments is a difficult problem requiring both perception control components. We propose solution to the component while cleanly abstracting perception. show that this clean abstraction can be used synthesize verifiably safe reference trajectories using combination of reachability analysis Mixed Integer Linear Programming. Experiments with prototype implementation algorithm promise as it has subsecond synthesis performance for nonlinear vehicle models scenarios hundred plus obstacles on standard hardware.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Space-time planning in unknown dynamic environments

Numerous path planning solutions have been proposed to solve the navigation problem in static environments, potentially populated with dynamic obstacles. However, in dynamic environments, moving objects can be used to reach new locations. In this paper, we propose an online planning algorithm for unknown dynamic environments that focuses on accessibility and on the use of objects movements to r...

متن کامل

Path Planning and Learning Strategies for Mobile Robots in Dynamic Partially Unknown Environments

....................................................................................................... 8

متن کامل

Mobile Platform Self-localization in Partially Unknown Dynamic Environments

Localization methods for mobile platforms are commonly based on an observation model that matches onboard sensors measures and environmental a priori knowledge. However, their effectiveness relies on the reliability of the observation model, which is usually very sensitive to the presence of unmodelled elements in the environment. Mismatches between the navigation map, itself an imperfect repre...

متن کامل

A Hybrid Path Planning Technique for Partially Unknown Indoor Environments

This paper presents an exploration algorithm for partially or totally unknown environments. The method is based on a representation that integrates metric and topological paradigms. The metric paradigm produces an accurate representation of the environment. The topological map is built over the metric map by means of a hierarchical structure. It reduces the metric data volume and can be process...

متن کامل

Optimal and Efficient Path Planning for Unknown and Dynamic Environments

The task of planning trajectories for a mobile robot has received considerable attention in the research literature. Algorithms exist for handling a variety of robot shapes, configurations, motion constraints, and environmens. Most of the work assumes the robot has a complete and accurate model of its environment before it begins to move; less attention has been paid to the problem of unknown o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2021

ISSN: ['2405-8963', '2405-8971']

DOI: https://doi.org/10.1016/j.ifacol.2021.08.493